enumeration procedure - traduzione in russo
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

enumeration procedure - traduzione in russo

CLASS OF COMBINATORIAL ENUMERATION PROBLEMS
Graphical enumeration; Enumeration of graphs
  • free trees]] on 2, 3, and 4 labeled vertices: <math>2^{2-2}=1</math> tree with 2 vertices,
<math>3^{3-2}=3</math> trees with 3 vertices, and <math>4^{4-2}=16</math> trees with 4 vertices.

enumeration procedure      

математика

процедура перебора

standard procedure         
SET OF STEP-BY-STEP INSTRUCTIONS COMPILED BY AN ORGANIZATION TO HELP WORKERS CARRY OUT ROUTINE OPERATIONS
Standard Operating Procedures; Standard procedures; Standard Operating Procedure; General operating procedure; General operating procedures; General Operating Procedures; General Operating Procedure; Standard operating procedures; Standing operating procedure; S.O.P.; Standard procedure
типовая процедура
enumeration of graphs         

математика

перечисление графов

Definizione

civil procedure
n. the complex and often confusing body of rules and regulations set out in both state (usually Code of Civil Procedure) and federal (Federal Code of Procedure) laws which establish the format under which civil lawsuits are filed, pursued and tried. Civil procedure refers only to form and procedure, and not to the substantive law which gives people the right to sue or defend a lawsuit. See also: civil civil action civil code civil law

Wikipedia

Graph enumeration

In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the graph. These problems may be solved either exactly (as an algebraic enumeration problem) or asymptotically. The pioneers in this area of mathematics were George Pólya, Arthur Cayley and J. Howard Redfield.

Traduzione di &#39enumeration procedure&#39 in Russo